A Continuous–Time Markov Chain Modeling Cancer–Immune System Interactions
نویسندگان
چکیده
منابع مشابه
Relative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملMarkov Chain Modeling of Performance Degradation of Photovoltaic System
Modern probability theory studies chance processes for which the knowledge of previous outcomes influence predictions for future experiments. In principle, when a sequence of chance experiments, all of the past outcomes could influence the predictions for the next experiment. In Markov chain type of chance, the outcome of a given experiment can affect the outcome of the next experiment. The sys...
متن کاملA Markov Chain Approximation to Choice Modeling
Assortment optimization is an important problem that arises in many industries such as retailing and airlines where the decision maker needs to decide on an optimal subset of products to offer to maximize the expected revenue. The demand and the revenue of any product depends on the complete set of offered products since customers potentially substitute to an available product if their most pre...
متن کاملAlgorithms for variable length Markov chain modeling
UNLABELLED We present a general purpose implementation of variable length Markov models. Contrary to fixed order Markov models, these models are not restricted to a predefined uniform depth. Rather, by examining the training data, a model is constructed that fits higher order Markov dependencies where such contexts exist, while using lower order Markov dependencies elsewhere. As both theoretica...
متن کاملNumerical Methods in Markov Chain Modeling
This paper describes and compares several methods for computing stationary probability distributions of Markov chains. The main linear algebra problem consists of computing an eigenvector of a sparse, non-symmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous, singular linear system. We present several methods based on combinations of Kry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Applied and Industrial Mathematics
سال: 2018
ISSN: 2038-0909
DOI: 10.2478/caim-2018-0018